COUNTING SPERMA AKTIF MENGGUNAKAN METODE OTSU THRESHOLD DAN LOCAL ADAPTIVE THRESHOLD
نویسندگان
چکیده
منابع مشابه
Counting Hypergraph Matchings up to Uniqueness Threshold
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter λ, each matching M is assigned a weight λ|M |. The counting problem is formulated as computing a partition function that gives the sum of the weights of all matchings in a hypergraph. This problem unifies two extensively studied statistical...
متن کاملCounting Spanning Trees of Threshold Graphs
Cayley’s formula states that there are n spanning trees in the complete graph on n vertices; it has been proved in more than a dozen different ways over its 150 year history. The complete graphs are a special case of threshold graphs, and using Merris’ Theorem and the Matrix Tree Theorem, there is a strikingly simple formula for counting the number of spanning trees in a threshold graph on n ve...
متن کاملAdaptive Threshold Sampling and Estimation
Sampling is a fundamental problem in both computer science and statistics. A number of issues arise when designing a method based on sampling. These include statistical considerations such as constructing a good sampling design and ensuring there are good, tractable estimators for the quantities of interest as well as computational considerations such as designing fast algorithms for streaming ...
متن کاملAdaptive Security for Threshold Cryptosystems
We present adaptively-secure efficient solutions to several central problems in the area of threshold cryptography. We prove these solutions to withstand adaptive attackers that choose parties for corruption at any time during the run of the protocol. In contrast, all previously known efficient protocols for these problems were proven secure only against less realistic static adversaries that c...
متن کاملFormal Concept Sampling for Counting and Threshold-Free Local Pattern Mining
We describe a Metropolis-Hastings algorithm for sampling formal concepts, i.e., closed (item-) sets, according to any desired strictly positive distribution. Important applications are (a) estimating the number of all formal concepts as well as (b) discovering any number of interesting, non-redundant, and representative local patterns. Setting (a) can be used for estimating the runtime of algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Teknika: Engineering and Sains Journal
سال: 2017
ISSN: 2579-5422,2580-4146
DOI: 10.51804/tesj.v1i1.68.47-54